#define _CRT_SECURE_NO_WARNINGS

#include "Sort.h"

int main()
{
	int a[] = { 5,4,3,2,1 };
	CountSort(a, sizeof(a) / sizeof(int));
	//printf("%d\n", sizeof(a));
	//BubbleSort(a, sizeof(a) / sizeof(int));
	//ShellSort(a, sizeof(a)/sizeof(int));
	//InsertSort(a, sizeof(a) / sizeof(int));
	//HeapSort(a, sizeof(a)/sizeof(int));
	//SelectSort(a, sizeof(a) / sizeof(int));
	//QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	//QuickSortNonR(a, sizeof(a) / sizeof(int));

	//vector<int> a = { 5,4,3,2,1 };
	//MergeSort(a);
	//MergeSortNonR(a);
	for (int i = 0; i < sizeof(a) / sizeof(int); i++)
	{
		printf("%d ", a[i]);
	}
	return 0;
}